Observability Don't Care Sets and Boolean Relations
نویسندگان
چکیده
A new algorithm is presented that computes exact or approximate ob-servability don't care (ODC) sets for multiple-level combinational network. The proposed algorithms are eecient because they use only local information. A method for deriving the equivalence classes of a Boolean relation from the observability don't care sets is then proposed. Experimental results on computing ODC sets are reported.
منابع مشابه
Derivation of Don't care Conditions
In this paper we present a framework for the derivation of don', care conditions by permrbaIion analysis of combinational multiple-level digital cUcuilS. The contribution of the paper is two-fold. First. different approximations of observability don', care selS are compared quantitatively. S~d. the perturbation analysis is used to derive new compatible obsa'Vabilily don', care sets. that are la...
متن کاملComputing Observability Don't Cares Eeciently through Polarization
| A new method is presented to compute the exact observability don't cares (ODCs) for multiple-level com-binational circuits. A new mathematical concept, called polarization , is introduced. Polarization captures the essence of ODC calculation on the otherwise diicult points of recon-vergence. It makes it possible to derive the ODC of a node from the ODCs of its fanouts with a very simple formu...
متن کاملComputing observability don't cares efficiently through polarization
A new method is presented to compute the exact observability don’t cares (ODC’s) for multiple-level combinational circuits. A new mathematical concept, called polarization, is introduced. Polarization captures the essence of ODC calculation on the otherwise difficult points of reconvergence. It makes it possible to derive the ODC of a node from the ODC’s of its fanouts with a very simple formul...
متن کاملHeuristic Minimization for Synchronous Relations
Optimization for synchronous systems is an important problem in logic synthesis. However, the full utilization of don't care information for sequential synthesis is far from being solved. Synchronous boolean relations can represent sequential don't care information upto in synchronous systems. This allows greater exibility in expressing don't care information than ordinary boolean relations rel...
متن کاملDon’t-Care Computation using k-clause Approximation
Computation of the satisfiability and observability care sets for a sub-circuit in a Boolean network is essentially a problem of quantifier elimination in propositional logic. In this paper, we introduce a method of approximate quantifier elimination that computes the strongest over-approximation expressible using clauses of a given length. The method uses a Boolean satisfiability solver in a m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990